Scalable visibility color map construction in spatial databases
نویسندگان
چکیده
منابع مشابه
Scalable Visibility Color Map Construction in Spatial Databases
Recent advances in 3D modeling provide us with real 3D datasets to answer queries, such as “What is the best position for a new billboard?” and “Which hotel room has the best view?” in the presence of obstacles. These applications require measuring and differentiating the visibility of an object (target) from different viewpoints in a dataspace, e.g., a billboard may be seen from two viewpoints...
متن کاملVisibility Color Map for a Fixed or Moving Target in Spatial Databases
The widespread availability of 3D city models enables us to answer a wide range of spatial visibility queries in the presence of obstacles (e.g., buildings). Example queries include “what is the best position for placing a billboard in a city?” or “which hotel gives the best view of the city skyline?”. These queries require computing and differentiating the visibility of a target object from ea...
متن کاملCritique & Summary of Scalable Network Distance Browsing in Spatial Databases
Introduction In today's world, the mapping services like Google Maps, Microsoft MapPoint etc have gained significant popularity for finding the shortest route while travelling from place to place. These services are available online and hence the responses of it must be real time i.e. very quick. Study has revealed that people do not change the parent query however may change the sub queries wi...
متن کاملA Scalable Algorithm for Maximizing Range Sum in Spatial Databases
This paper investigates theMaxRS problem in spatial databases. Given a set O of weighted points and a rectangular region r of a given size, the goal of the MaxRS problem is to find a location of r such that the sum of the weights of all the points covered by r is maximized. This problem is useful in many location-based applications such as finding the best place for a new franchise store with a...
متن کاملThe spherical visibility map
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of a doubly–connected edge list embedded on the surface of a sphere. Each face of the spherical map is labeled with the polygon visible in the corresponding cone. We demonstrate that the algorithm is efficient and robust ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2014
ISSN: 0306-4379
DOI: 10.1016/j.is.2013.12.002